Search results for "Self-synchronizing code"

showing 3 items of 3 documents

On the decomposition of prefix codes

2017

Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.

Block codePrefix codeGeneral Computer ScienceComputer science0102 computer and information sciences02 engineering and technologyPrefix grammarKraft's inequality01 natural sciencesPrefix codeTheoretical Computer SciencePrefix codes; Finite automata; Composition of codesComposition of codes0202 electrical engineering electronic engineering information engineeringDiscrete mathematicsSelf-synchronizing codeFinite-state machineSettore INF/01 - InformaticaComputer Science (all)Rational languageLinear codePrefixComposition of code010201 computation theory & mathematicsPrefix codes020201 artificial intelligence & image processingFinite automataComputer Science::Formal Languages and Automata Theory
researchProduct

Gray code for permutations with a fixed number of cycles

2007

AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycles. In this code, each permutation is transformed into its successor by a product with a cycle of length three, which is optimal. If we represent each permutation by its transposition array then the obtained list still remains a Gray code and this allows us to construct a constant amortized time (CAT) algorithm for generating these codes. Also, Gray code and generating algorithm for n-length permutations with fixed number of left-to-right minima are discussed.

Golomb–Dickman constantPolynomial codeRestricted permutationsGenerating algorithms0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceGray codeCombinatoricsPermutation[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsTransposition arrayComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsSelf-synchronizing codeAmortized analysisMathematics::CombinatoricsParity of a permutation020206 networking & telecommunicationsGray codes010201 computation theory & mathematicsConstant-weight codeMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Diagonal space time hadamard codes with erasure decoding algorithm

2005

A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…

Prefix codeBlock codePolynomial codeComputer scienceConcatenationList decodingData_CODINGANDINFORMATIONTHEORYSequential decodingLocally testable codeSystematic codeReed–Solomon error correctionHadamard transformCyclic codeFadingLow-density parity-check codeComputer Science::Information TheorySelf-synchronizing codeHadamard codeConcatenated error correction codeReed–Muller codeSerial concatenated convolutional codesAntenna diversityLinear codeConvolutional codeErasureConstant-weight codeErasure codeAlgorithmDecoding methodsCommunication channelIEEE Wireless Communications and Networking Conference, 2005
researchProduct